OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Source URL: ludovicpatey.com

• Computability theory
• Mathematical logic
• Proof theory
• Theory of computation
• Logic in computer science
• Computable function
• Reverse mathematics
• PA degree
• Peano axioms

Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Source URL: ludovicpatey.com

• Computability theory
• Theory of computation
• Mathematics
• Theoretical computer science
• Mathematical analysis
• Computable function
• Sigma-algebra
• Generalised Whitehead product

Type-based Taint Analysis for Java Web Applications Wei Huang, Yao Dong, and Ana Milanova Rensselaer Polytechnic Institute Abstract. Static taint analysis detects information flow vulnerabilities.

Source URL: www.cs.rpi.edu

ECAMP One Page Extended Abstract Template (Title Should Be Centred 14 pt Bold Type, with Title Case Formatting – Elements and Acronyms Should Be Capitalized) Author name(s) [10-point type, centred, bolded] Author’s

Source URL: www.ecamp.uni-frankfurt.de

AUTOMORPHISMS OF FUSION SYSTEMS OF FINITE SIMPLE GROUPS OF LIE TYPE CARLES BROTO, JESPER M. MØLLER, AND BOB OLIVER Abstract. For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusi

Source URL: www.math.univ-paris13.fr

• Algebra
• Abstract algebra
• Group theory
• Finite groups
• Sylow theorems
• P-group
• Group extension
• Automorphism
• Abelian group
• PSL
• Center
• Group of Lie type

Dependent Type Providers David Raymond Christiansen IT University of Copenhagen Abstract

Source URL: www.davidchristiansen.dk

The strength of Martin-L¨of type theory with a superuniverse. Part II Michael Rathjen∗ School of Mathematics, University of Leeds, Leeds LS2 9JT, UK Abstract

Source URL: www1.maths.leeds.ac.uk

The Strength of Some Martin–L¨of Type Theories Michael Rathjen∗† Abstract One objective of this paper is the determination of the proof–theoretic strength of Martin– L¨

Source URL: www1.maths.leeds.ac.uk

Realizing Mahlo set theory in type theory Michael Rathjen∗ Abstract After introducing the large set notion of Mahloness, this paper shows that constructive set theory with an axiom asserting the existence of a Mahlo se

Source URL: www1.maths.leeds.ac.uk

FROBENIUS PROPERTY OF A WEAK FACTORISATION SYSTEM Abstract. In this note I would like to show that if a locally Cartesian closed category with the type structure induced by a weak factorisation system supports Π-types,

Source URL: covariant.me